Welcome![Sign In][Sign Up]
Location:
Search - graph cut

Search list

[Graph programvc1512mfc

Description: 基于vc++的任意图形裁剪,利用计算机图形学原理,-Vc++ based on an arbitrary graph cut, using computer graphics principles,
Platform: | Size: 3682304 | Author: fasf | Hits:

[OpenGL programGraph

Description: 图形学完整课件,包括光栅图形学,图形裁剪,基本几何,二维几何,图形变换,三维几何,几何造型,光照模型,曲线与曲面,曲线拟合与双圆弧逼近,交互技术等。-Graphics complete courseware, including raster graphics, graphic cut, basic geometry, two-dimensional geometry, graph transformation, three-dimensional geometry, geometric modeling, illumination models, curves and surfaces, curve fitting and double arc approximation, interactive technology.
Platform: | Size: 7930880 | Author: 朵朵 | Hits:

[Special Effectsmaxflow-v3.01.src.tar

Description: 基于文献“计算机视觉中的能量函数最小化的最小割/最大流”的最大流算法实现-An implementation of the maxflow algorithm described in An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Computer Vision. Yuri Boykov and Vladimir Kolmogorov. In IEEE Transactions on Pattern Analysis and Machine Intelligence, September 2004.
Platform: | Size: 13312 | Author: illusionme | Hits:

[Graph program10

Description: This source code contains: -BFS algorithm on a graph -Edmonds­ Karp algorithm on a graph -minimal cut on a graph -disjunct paths in a graph.
Platform: | Size: 3072 | Author: Belet Teodor | Hits:

[Special Effectsgrah_cut_[11]

Description: classical paper of graph cut methods in video processing used for image partitioning-classical paper of graph cut methods in video processing used for image partitioning
Platform: | Size: 584704 | Author: huang | Hits:

[Special EffectsKZ-ECCV02-graphcuts

Description: minimizing energy function,such as in MRF,by graph cut methods
Platform: | Size: 154624 | Author: huang | Hits:

[matlabKZ-PAMi04

Description: also classical papers in energy minimizing by graph cut methods
Platform: | Size: 304128 | Author: huang | Hits:

[Special Effectsgraph--cut

Description: 图形裁剪: 线段裁剪和多边形裁剪的简单示例-Graphics Clipping: Line Clipping and Polygon Clipping simple example
Platform: | Size: 361472 | Author: holly | Hits:

[Special EffectsClip

Description: 二维图形裁剪算法,矩形与任意多边形剪裁, Weiler-Atherton边界裁剪法,-Two-dimensional graph cut algorithm
Platform: | Size: 109568 | Author: a | Hits:

[Special Effectsgraph_cut

Description: 图像分割ppt,介绍graph cut的基本原理-introduce what about graph cut
Platform: | Size: 2573312 | Author: mstar | Hits:

[GDI-BitmapGraph

Description: 功能比较全面,可以实现三维图形变换及二维图形裁剪的功能-three dimensional transform two dimensional cut out
Platform: | Size: 93184 | Author: 张龙 | Hits:

[Graph DrawingDraw

Description: 基于Visual C++ 6.0开发系统,仿制Windows画图软件,实现如下功能: 1. 动态绘制文本、直线、矩形、圆(椭圆)、多边形等基本图形; 2. 可以改变图形的颜色、粗细、线型(实线、虚线、点划线等); 3. 可以实现图形的剪切、复制、粘贴、缩放(全部或指定区域)等基本编辑功能; 4. 基本的图形保存、打开、显示等功能;-Based on Visual C++ 6.0 development system, generic Windows drawing software, to achieve the following functions: 1. Dynamic draw text, line, rectangle, circle (oval), polygons and other basic graphics 2. Can change the graph color, thickness, line type (solid line, dashed, dotted, etc.) 3. can graph cut, copy, paste, zoom (in whole or in designated areas) and other basic editing functions 4. basic graphic save, open, display and other functions
Platform: | Size: 4000768 | Author: 李超 | Hits:

[Special Effectsgraphcutforcpp

Description: 这是一个基于图割算法的立体匹配程序。本程序给出了相应的c/c++代码,可以在Unix和windows下进行编译和执行。效果很好!-This is a graph cut algorithm based on stereo matching process. This procedure gives the corresponding c/c++ code can be compiled under Unix and windows and execution. Good results!
Platform: | Size: 46080 | Author: peter | Hits:

[Special EffectsGCimagematching

Description: 利用图割方法进行立体匹配的文档,有硕士论文有小论文,我从十几篇当中挑出来的,感觉很有用,方便没有数据库用的同学-Three-dimensional graph cut method using matching documents, with a small paper Master thesis, I picked out from more than a dozen of them, feel useful, to facilitate students with no database
Platform: | Size: 7240704 | Author: 沈玉杰 | Hits:

[Special EffectsNovel-robust-and-self-adaptive-road-following-algo

Description: 本文提出一种基于改进图模型的自适应道路跟踪算法,利用基于边缘置信度的均值偏移 算法,将图像划分为具有准确边界的若干同质区域,以这些区域为结点构建改进图模型,然后根据道路/非路模型统计信息,采用 Graph Cut 方法获得最终的二值图。该算法将Graph Cut 和均值偏移方法有效融合,以克服各自缺点,并通过道路/非路模型自更 新使得该算法可有效适应室外环境下复杂场景变化。-Two dimension road following is a crucial task of vision navigation for mobile robots. Because road environments are usually complex, robust and continuous road following based on two-dimension image sequence is still a challenging task. This paper proposes a self-adaptive road following algorithm based on an improved graph model. Firstly, the mean shift algorithm embedded with edge confidence is used to partition the images into homogenous regions with precise boundary, and an improved graph model is constructed with these regions.
Platform: | Size: 2178048 | Author: 黄松 | Hits:

[Special Effects5

Description: 图形相交—相切。用vc++6.0实现的把相交图形相交的部分剪切。-Graphics intersection- tangent. Achieved with the vc++6.0 intersection part of the intersection graph cut.
Platform: | Size: 23552 | Author: 徐华伟 | Hits:

[Special Effectsgraphcut

Description: 最大流最小割,用于图片分割以及与图片分割类似的网络问题-Maxflow/minium cut,used in graph cut or other similar problem
Platform: | Size: 15360 | Author: ww | Hits:

[JSP/JavaMaxCut

Description: This program implement the Max cut Max_Cut algorithm , as a deterministic algorithm using a pair wise method , which force the algorithm for deterministic solution with solution better then |E|/2 the graph is implemented using an adjacent matrix, the nodes are chosen randomaly k = the number of bits for represntation n = 2^k -1 The pair wise method implement as a matrix , using a XOR command, the columns in the matrix represent all of the sub -groups in a pair wise way Good luck Shahar -This program implement the Max cut Max_Cut algorithm , as a deterministic algorithm using a pair wise method , which force the algorithm for deterministic solution with solution better then |E|/2 the graph is implemented using an adjacent matrix, the nodes are chosen randomaly k = the number of bits for represntation n = 2^k -1 The pair wise method implement as a matrix , using a XOR command, the columns in the matrix represent all of the sub -groups in a pair wise way Good luck Shahar
Platform: | Size: 5120 | Author: shahar | Hits:

[Special Effectsregionpushrelabel-v1.01

Description: graphcut应用 Global optimisation via s-t graph cuts is widely used in computer vision and graphics. To obtain high-resolution output, graph cut methods must construct massive N-D grid-graphs containing billions of vertices. We show that when these graphs do not fit into physical memory, current max-flow/min-cut algorithms—-A Scalable Graph-Cut Algorithm for N-D Grids
Platform: | Size: 26624 | Author: hahaha | Hits:

[matlabboykov-iccv-01

Description: 有关于图像分割的一篇重要文献,写得比较清晰,理解容易-graph cut
Platform: | Size: 267264 | Author: 小白 | Hits:
« 1 2 3 4 5 6 7 89 10 11 12 13 14 »

CodeBus www.codebus.net